Multi-Area Reserve Dimensioning Using Chance-Constrained Optimization

نویسندگان

چکیده

We propose a chance-constrained formulation for the problem of dimensioning frequency restoration reserves on power transmission network. cast our as two-stage stochastic mixed integer linear program, and heuristic algorithm solving problem. Our model accounts simultaneous sizing both upward downward reserves, uncertainty driven by imbalances, contingencies available capacity. core methodology is further adapted in order to minimize inter-zonal flows split reserve requirements between automatic manual reserves. apply four load control areas Swedish system. demonstrate benefits method terms decreasing absence sharing, we analyze spatial allocation perform various sensitivity analyses.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chance constrained uncertain classification via robust optimization

This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain datapoints are classified correctly with high probability. Unfortunately such a CCP turns out to be intractable. The key novelty is in employing Bernstein bounding schemes to relax the CCP as ...

متن کامل

Global optimization of robust chance constrained problems

We propose a stochastic algorithm for the global optimization of chance constrained problems. We assume that the probability measure with which the constraints are evaluated is known only through its moments. The algorithm proceeds in two phases. In the first phase the probability distribution is (coarsely) discretized and solved to global optimality using a stochastic algorithm. We only assume...

متن کامل

Ambiguous chance constrained problems and robust optimization

In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are themselves uncertain. We focus primarily on the special case where the uncertainty set Q of the distributions is of the form Q = {Q : ρp(Q, Q0) ≤ β}, where ρp denotes the Prohorov metric. The ambiguous chance constrained problem is approximated by a robust sampled pro...

متن کامل

Duality for Linear Chance-constrained Optimization Problems

In this paper we deal with linear chance-constrained optimization problems, a class of problems which naturally arise in practical applications in finance, engineering, transportation and scheduling, where decisions are made in presence of uncertainty. After giving the deterministic equivalent formulation of a linear chance-constrained optimization problem we construct a conjugate dual problem ...

متن کامل

Convex relaxations of chance constrained optimization problems

In this paper we develop convex relaxations of chance constrained optimization problems in order to obtain lower bounds on the optimal value. Unlike existing statistical lower bounding techniques, our approach is designed to provide deterministic lower bounds. We show that a version of the proposed scheme leads to a tractable convex relaxation when the chance constraint function is affine with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Power Systems

سال: 2022

ISSN: ['0885-8950', '1558-0679']

DOI: https://doi.org/10.1109/tpwrs.2021.3133102